Home > Search Results: keywords:"solar array"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Planning Solar Array Operations on the ISS
 Jelínek, Jan ; Barták, Roman (advisor) ; Vilím, Petr (referee)
This work focuses on the problem of planning solar array operations on the International Space Station. The goal is to find a viable orientation for ten joints which attach panels to the station. These orientations and modes must satisfy various constraints and the final schedule should also take into account certain preferences. This is a task suitable for automated planning and scheduling, but new technologies are gaining very slowly in the field of the human spaceflights. In this work we will analyze the current solution of this problem and then we will propose a new algorithm that will exploit techniques of automated planning and scheduling. In the contrast with the original greedy algorithm, the suggested algorithm initially finds any solution and then tries to improve it by optimazing partial objective functions. Due to the size of the search space, the search attempts are limited by the time limit. Powered by TCPDF (www.tcpdf.org)
Detailed record
Planning Solar Array Operations on the ISS
 Jelínek, Jan ; Barták, Roman (advisor) ; Vilím, Petr (referee)
This work focuses on the problem of planning solar array operations on the International Space Station. The goal is to find a viable orientation for ten joints which attach panels to the station. These orientations and modes must satisfy various constraints and the final schedule should also take into account certain preferences. This is a task suitable for automated planning and scheduling, but new technologies are gaining very slowly in the field of the human spaceflights. In this work we will analyze the current solution of this problem and then we will propose a new algorithm that will exploit techniques of automated planning and scheduling. In the contrast with the original greedy algorithm, the suggested algorithm initially finds any solution and then tries to improve it by optimazing partial objective functions. Due to the size of the search space, the search attempts are limited by the time limit. Powered by TCPDF (www.tcpdf.org)
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English